2D Centroidal Voronoi Tessellations with Constraints
نویسندگان
چکیده
منابع مشابه
2D Centroidal Voronoi Tessellations with Constraints
We tackle the problem of constructing 2D centroidal Voronoi tessellations with constraints through an efficient and robust construction of bounded Voronoi diagrams, the pseudo-dual of the constrained Delaunay triangulation. We exploit the fact that the cells of the bounded Voronoi diagram can be obtained by clipping the ordinary ones against the constrained Delaunay edges. The clipping itself i...
متن کاملEdge-Weighted Centroidal Voronoi Tessellations
Most existing applications of centroidal Voronoi tessellations (CVTs) lack consideration of the length of the cluster boundaries. In this paper we propose a new model and algorithms to produce segmentations which would minimize the total energy — a sum of the classic CVT energy and the weighted length of cluster boundaries. To distinguish it with the classic CVTs, we call it an Edge-Weighted CV...
متن کاملSpherical Layout Implementation using Centroidal Voronoi Tessellations
The 3D tree visualization faces multiple challenges: the election of an appropriate layout, the use of the interactions that make the data exploration easier and a metaphor that helps in the process of information understanding. A good combination of these elements will result in a visualization that effectively conveys the key features of a complex structure or system to a wide range of users ...
متن کاملAcceleration schemes for computing centroidal Voronoi tessellations
Centroidal Voronoi tessellations (CVT) have diverse applications in many areas of science and engineering. The development of e cient algorithms for their construction is a key to their success in practice. In this paper, we study some new algorithms for the numerical computation of the CVT, including the Lloyd–Newton iteration and the optimization based multilevel method. Both theoretical anal...
متن کاملFast Methods for Computing Centroidal Voronoi Tessellations
ACentroidalVoronoi tessellation (CVT) is aVoronoi tessellation inwhich the generators are the centroids for each Voronoi region. CVTs have many applications to computer graphics, image processing, data compression, mesh generation, and optimal quantization. Lloyd’s method, the most widely method used to generate CVTs, converges very slowly for larger scale problems. Recently quasi-Newton method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Mathematics: Theory, Methods and Applications
سال: 2010
ISSN: 1004-8979,2079-7338
DOI: 10.4208/nmtma.2010.32s.6